| 1. | Virtually the only concept to be used is that of a spanning tree .
更确切地说，只使用了生成树的概念。 |
| 2. | Evidently, the graph must be connected in order to contain a spanning tree .
显然一个图必须是连通的才能包含一生成树。 |
| 3. | There is a recursive formula for the number of spanning trees in a graph .
对于一个图的生成树的棵数，存在一个递推公式。 |
| 4. | In particular, if t is a spanning tree of g, we shall call its complement t' a cotree .
如果T是G的一棵生成树，我们称它的补集T'为一副树。 |
| 5. | The relationship between bonds and cotrees is analogous to that between cycles and spanning trees .
键和余树之间的关系类似于圈和生成树之间的关系。 |
| 6. | A protection algorithm for mesh virtual ring based on spanning tree
一种光网络中统一网管的实现方案 |
| 7. | Algorithm of documents categorization based on bayesian - spanning tree
基于贝叶斯扩张树的文本分类算法 |
| 8. | Algorithm and analysis of fuzzy minimal spanning tree in fluid pipeline networks
流体管网中模糊最小树的算法与分析 |
| 9. | Asymptotic enumeration theorem for the number of spanning trees in grids and tori
格子图与环纹面的支撑树数的渐近定理 |
| 10. | Minimum spanning tree algorithm based on extended double list storage structure
基于扩展双链式存储结构的最小生成树算法 |
